Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

Resequencing with parallel queues to minimize the maximum number of items in the overflow area

This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016     

对目标打击概率的数学模型及分析

通过分析识别跟踪攻击目标的过程,建立了攻击目标打击概率的数学模型和基本算法,通过计算机采用蒙特卡罗法模拟计算了不同条件下对目标的打击概率,以此研究影响打击概率的因素.计算结果表明,武器系统的作战半径和威力半径两个因素对打击概率影响较大,误差因素在一定范围内影响较小,各参数之间存在优化匹配的空间.     

Mean residual life of coherent systems consisting of multiple types of dependent components

Mean residual life is a useful dynamic characteristic to study reliability of a system. It has been widely considered in the literature not only for single unit systems but also for coherent systems. This article is concerned with the study of mean residual life for a coherent system that consists of multiple types of dependent components. In particular, the survival signature based generalized mixture representation is obtained for the survival function of a coherent system and it is used to evaluate the mean residual life function. Furthermore, two mean residual life functions under different conditional events on components’ lifetimes are also defined and studied.     

Properties of a mean residual life function arising from renewal theory

The present article discusses the properties of the mean residual life function in a renewal process. We examine the relationship this function has with the failure rate function and the conventional mean, variance and coefficient of variation of residual life. We also discuss some monotonicity properties of the mean residual life function. A partial order based on the renewal mean residual function is introduced along with its interrelationship with some existing stochastic orders. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Estimating failure time distribution and its parameters based on intermediate data from a Wiener degradation model

Instead of measuring a Wiener degradation or performance process at predetermined time points to track degradation or performance of a product for estimating its lifetime, we propose to obtain the first‐passage times of the process over certain nonfailure thresholds. Based on only these intermediate data, we obtain the uniformly minimum variance unbiased estimator and uniformly most accurate confidence interval for the mean lifetime. For estimating the lifetime distribution function, we propose a modified maximum likelihood estimator and a new estimator and prove that, by increasing the sample size of the intermediate data, these estimators and the above‐mentioned estimator of the mean lifetime can achieve the same levels of accuracy as the estimators assuming one has failure times. Thus, our method of using only intermediate data is useful for highly reliable products when their failure times are difficult to obtain. Furthermore, we show that the proposed new estimator of the lifetime distribution function is more accurate than the standard and modified maximum likelihood estimators. We also obtain approximate confidence intervals for the lifetime distribution function and its percentiles. Finally, we use light‐emitting diodes as an example to illustrate our method and demonstrate how to validate the Wiener assumption during the testing. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

捷联惯导系统快速自对准误差模型的建立

通过对惯性制导系统两个基本方程的研究,求出了各状态矢量在各坐标系下的微分方程,然后以ψ角法所确立的平台为基准,分别推导得出惯性制导系统各主要状态的微分方程,从而建立了捷联惯性制导系统的误差模型.最后根据静基座捷联惯导系统初始对准的特点对其进行简化,得到了静基座捷联惯导系统快速自对准的误差模型.     

基于RLS算法的自适应逆控制系统的研究

提出了一种基于RLS算法的自适应逆控制系统,并对最小相位对象和非最小相位对象分别用此系统建模,进行仿真研究.仿真结果表明,基于RLS算法的自适应逆控制系统的收敛速度快,抗干扰性能好,而且得到的稳态误差较小.     

接触触发式测头触发力的理论分析

对用于三坐标测量机及数控机床的接触触发式测头在触测发讯时的触发力进行了理论分析和计算,得出了触发力的大小与其结构参数之间的关系,从而为触发式测头的误差补偿提供了理论基础。     

A logistics scheduling model: Inventory cost reduction by batching

Logistics scheduling refers to the problems where the decisions of job scheduling and transportation are integrated in a single framework. In this paper, we discuss a logistics scheduling model where the raw material is delivered to the shop in batches. By making the batching and scheduling decisions simultaneously, the total inventory and batch setup cost can be reduced. We study different models on this issue, present complexity analysis and optimal algorithms, and conduct computational experiments. Some managerial insights are observed. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.